Rocket Testing and Integrated System Health Management

Integrated System Health Management (ISHM) describes a set of system capabilities that in aggregate perform: determination of condition for each system element, detection of anomalies, diagnosis of causes for anomalies, and prognostics for future anomalies and system behavior. The ISHM should also provide operators with situational awareness of the system by integrating contextual and timely data, information, and knowledge (DIaK) as needed. ISHM capabilities can be implemented using a variety of technologies and tools. This chapter provides an overview of ISHM contributing technologies and describes in further detail a novel implementation architecture along with associated taxonomy, ontology, and standards. The operational ISHM testbed is based on a subsystem of a rocket engine test stand. Such test stands contain many elements that are common to manufacturing systems, and thereby serve to illustrate the potential benefits and methodologies of the ISHM approach for intelligent manufacturing

A wireless sensor network-based approach to large-scale dimensional metrology

In many branches of industry, dimensional measurements have become an important part of the production cycle, in order to check product compliance with specifications. This task is not trivial especially when dealing with largescale dimensional measurements: the bigger the measurement dimensions are, the harder is to achieve high accuracies. Nowadays, the problem can be handled using many metrological systems, based on different technologies (e.g. optical, mechanical, electromagnetic). Each of these systems is more or less adequate, depending upon measuring conditions, user's experience and skill, or other factors such as time, cost, accuracy and portability. This article focuses on a new possible approach to large-scale dimensional metrology based on wireless sensor networks. Advantages and drawbacks of such approach are analysed and deeply discussed. Then, the article briefly presents a recent prototype system - the Mobile Spatial Coordinate-Measuring System (MScMS-II) - which has been developed at the Industrial Metrology and Quality Laboratory of DISPEA - Politecnico di Torino. The system seems to be suitable for performing dimensional measurements of large-size objects (sizes on the order of several meters). Owing to its distributed nature, the system - based on a wireless network of optical devices - is portable, fully scalable with respect to dimensions and shapes and easily adaptable to different working environments. Preliminary results of experimental tests, aimed at evaluating system performance as well as research perspectives for further improvements, are discusse

Low power coordination in wireless ad-hoc networks

ABSTRACT Distributed wireless ad-hoc networks @WANs) pose numerous technical Among them, two are widely conthese problems, two are of dominating importance: (i) low energy and Operation and (ii) autonomous localized operation and decision making. Recent studies have shown sidered as crucial: autonomous localized operation and minimization of energy consumption. We address the fundamental problem of how to maximize life-time of the network by using only local information while preserving network connectivity, We start by introducing the Care-Ree Sleep (CS) Theorem that provides provably optimal necessary and nodes are not required for addressing the current network cient conditions for a node to turn off its radio while ensuring and Although there have been a number of efforts to deterthat global connectivity is not affected. The cS theorem is the basis for an efficient localized almine the conditions for a node to enter sleep state using gorithm that decides which node will turn its radio off, and only locally available information while preserving the overfor how long, The effectiveness of the approach is demonall connectivity of the network, only heuristic answers have sleep coordination problem. The sleep coordination problem the algorithm over a wide range of network parameters. is interesting and challenging from several view points: 0 Complexity of the Problem. The nodes that stay Categories and Subject Descriptors awake to preserve the connectivity of the network form a [ C O M P U T E R -C O M M U N I C A T I O N N E T W O R K S ] : connected dominating set on the network graph. Finding Network Protocols; C.4 [ P E R F O R M A N C E OF S Y S - the minimum connected dominating set can be proven to be TEMS]: [Reliability, availability, and serviceability] NP-complete. Therefore, even in cases where we do have the complete graph information about the whole network, finding the optimal solution in polynomial time is unlikely. Furthermore, setting the proper sleep times t o the nodes to maximize the overall network's lifetime, adds a new dimension to the NP-complete minimum connected dominating 0 Scope of the Problem. For a sleep coordination procedure, making a globally sound decision using only local information is a challenging task. Changing the status of even one node can potentially impact any node in the network ill terms Of its CODneCtiVity and energy consumption. 0 Guaranteed Connectivity. There is a need to determine under which conditions, a Particular node can sleep, while still guaranteeing that the network is connected. 0 Protocol Design. The autonomous operation of the nodes in DWANs has several advantages including fault tolerance, fast response to changes, and non-PrePlanned network structure. However, interaction and collaboration between the nodes and existence of shared resources, dictates a need for a protocol that can handle concurrency and synchronization of the autonomous ad-hoc node decisions. The power saving coordination strategy introduced here attempts to address these challenges. we start by introducing the care-nee sleep (CS) theorem that establishes provably optimal necessary and sufficient conditions for a given node to enter sleep state without disconnecting the network. strated using numerous simulations of the performance of been Presented [17, 3~ ' 1. we refer to this Problem as the General Terms Algorithms, Design, Performance Keywords set problem. Wireless ad-hoc network, low-power, coordinatio

A Fourier Analysis Based Attack against Physically Unclonable Functions

Electronic payment systems have leveraged the advantages offered by the RFID technology, whose security is promised to be improved by applying the notion of Physically Unclonable Functions (PUFs). Along with the evolution of PUFs, numerous successful attacks against PUFs have been proposed in the literature. Among these are machine learning (ML) attacks, ranging from heuristic approaches to provable algorithms, that have attracted great attention. Our paper pursues this line of research by introducing a Fourier analysis based attack against PUFs. More specifically, this paper focuses on two main aspects of ML attacks, namely being provable and noise tolerant. In this regard, we prove that our attack is naturally integrated into a provable Probably Approximately Correct (PAC) model. Moreover, we show that our attacks against known PUF families are effective and applicable even in the presence of noise. Our proof relies heavily on the intrinsic properties of these PUF families, namely arbiter, Ring Oscillator (RO), and Bistable Ring (BR) PUF families. We believe that our new style of ML algorithms, which take advantage of the Fourier analysis principle, can offer better measures of PUF security

TEMS]: [Reliability, availability, and serviceability] General Terms

Distributed wireless ad-hoc networks (DWANs) pose numerous technical challenges. Among them, two are widely considered as crucial: autonomous localized operation and minimization ofenergy consumption. We address the fundamental problem ofhow to maximize life-time ofthe network by using only local information while preserving network connectivity. We start by introducing the Care-Free Sleep (CS) Theorem that provides provably optimal necessary and sufficient conditions for a node to turn off its radio while ensuring that global connectivity is not affected. The CS theorem is the basis for an efficient localized algorithm that decides which node will turn its radio off, and for how long. The effectiveness of the approach is demonstrated using numerous simulations ofthe performance of the algorithm over a wide range ofnetwork parameters